A note on the least eigenvalue of a graph with given maximum degree
نویسندگان
چکیده
This note investigates the least eigenvalues of connected graphs with n vertices and maximum degree ∆, and characterizes the unique graph whose least eigenvalue achieves the minimum among all the connected graphs with n vertices and maximum vertex degree ∆ > n 2 .
منابع مشابه
Ela a Note on the Least Eigenvalue of a Graph with given Maximum Degree
This note investigates the least eigenvalues of connected graphs with n vertices and maximum degree ∆, and characterizes the unique graph whose least eigenvalue achieves the minimum among all the connected graphs with n vertices and maximum vertex degree ∆ > n 2 .
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملBounds for the Co-PI index of a graph
In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.
متن کاملNote on multiple Zagreb indices
The Zagreb indices are the oldest graph invariants used in mathematical chemistry to predict the chemical phenomena. In this paper we define the multiple versions of Zagreb indices based on degrees of vertices in a given graph and then we compute the first and second extremal graphs for them.
متن کامل